#include"BinaryTree.h"
#include"Queue.h"

void test()
{
	char a[17] = "ABD##E#H##CF##G##";
	int i = 0;
	BTNode* root=BinaryTreeCreate(a, 17, &i);
	BinaryTreePrevOrder(root);
	printf("\n");
	printf("BinaryTreeSize=%d\n",BinaryTreeSize(root));
	printf("BinaryTreeLeafSize=%d\n", BinaryTreeLeafSize(root));
	printf("BinaryTreeKLevelSize=%d\n", BinaryTreeKLevelSize(root, 2));
	printf("BinaryTreeLevelSize=%d\n", BinaryTreeLevelSize(root));
	BinaryTreeNonR(root);
	printf("BinaryTreeFind=%c\n", BinaryTreeFind(root, 'H')->data);
}




int main()
{
	test();
	return 0;
}